#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, a[N];
int main () {
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    scanf("%d", &n);
    for(int i = 1;i <= n;++i) scanf("%d", a+i);
    sort(a+1, a+n+1);
    int l = 1, r = 1;
    while(r <= n) {
        if(a[r] > a[l]) ++l;
        ++r;
    }
    printf("%d", n-(l-1));
    return 0;
}
